Probabilistic Flow Connectivity Mapping
نویسندگان
چکیده
Phase-Contrast (PC) MRI utilizes phase shifts resulting from moving spins to quantify tissue motion and blood flow. In cardio-vascular PC MRI applications, visualization techniques such as vector glyphs, streamlines, and particle traces are employed for depicting the flow situation. Whereas these techniques indeed provide useful information, they ignore the noise in the PC-MRI measurements and may even give a false sense of precision. With the aim of visualizing uncertainty in PC MRI, this work contributes a probabilistic flow connectivity mapping method in which possible flow traces are sampled using a sequential Monte Carlo approach. NOISE IN PC MRI MEASUREMENTS In a noise free PC MRI case, the flow velocities in one direction, say x, are encoded in the phase of a complex image , where is the true velocity in every voxel and is a sequence parameter setting the maximal measurable velocity. denotes a constant velocity encoding term as well as a static but uncontrollable spatially varying phase shift. To cancel , a second image is acquired, whereby the velocity can be found as (Eq. 1). In practice, independent Gaussian noise 0, contaminates both the real and imaginary parts of the measurement so that and . In [1], it is shown that, in high SNR areas ( ) such as the blood pool, the distribution of , and similarly for . Hence, the observed velocity , calculated according to Eq. 1, may be seen as drawn from the distribution , . In a 3D PC-MRI flow measurement, and images are acquired as well, and the velocities and are estimated analogously to Eq. 1. The joint distribution of the measured 3D vector v , , becomes multivariate Gaussian v v, . In [2], the univariate distribution of the flow magnitude v is derived for a diagonal isotropic covariance matrix. However, in the current case, the full multivariate distribution is required and the covariance matrix has a more complicated structure 2 1 1 1 2 1 1 1 2 because the image is involved in the calculation of all three velocity components. To fully specify , estimates of the noise variance and image magnitude are required. Manual and automatic methods for this estimation using a magnitude image, in the PC MRI case an average of the magnitudes of , , , and images, are described in [3]. In this work, and are estimated from manually delineated regions in the air and blood pool respectively. FLOW CONNECTIVITY MAPPING A conventional streamline or particle trace algorithm uses v as estimate of the true velocity and draws a flow path of a virtual particle that may be seen as the most likely in a maximum likelihood sense. In this work, the uncertainty associated with such a path is addressed. To this end, a sequential Monte Carlo approach is employed, in which trajectories are generated by iteratively sampling flow vectors from the multivariate Gaussian distribution described above. Using v as estimate of the true velocity, the procedure is similar to a streamline or particle trace algorithm, but with the addition of a random perturbation vector drawn from 0, in every tracking step. The generated trajectories are referred to as probabilistic streamlines or particle traces respectively. Each generated trajectory initiated at a point x may be seen as a sample from a global probability distribution of all possible paths a virtual particle may take from x. To visualize this distribution, a large number of trajectories (>1000) initiated at x are generated. From these trajectories, a flow connectivity map can be calculated by counting the number of trajectories that pass through each voxel and normalizing with the total number of trajectories. For time-resolved 4D PC MRI data, the connectivity map is also 4D and shows the probability of finding the virtual particle in a particular voxel and time interval. RESULTS AND DISCUSSION The flow connectivity mapping method is demonstrated using a 4D PC MRI data set of the aorta acquired with the following parameters: TE/TR 3.67/6.1 ms, flip angle 15°, 150 cm/s, spatiotemporal resolution 1.7 x 1.7 x 3.5 mm and 48.8 ms. The noise variance was estimated to 25 and the image magnitude in the blood pool to 55. Fig. 1a shows a regular streamline that traces the velocity field from a seed point in the ascending aorta into the left subclavian artery. For comparison, Fig. 1b shows 50 probabilistic streamlines initiated at the same point, illustrating different paths that may be taken when noise is accounted for. The results clearly demonstrate that the noise uncertainty can even lead to traces reaching other supra-aortic vessels, which was not indicated by the regular streamline. The flow connectivity map in Fig. 1c is based on 4000 probabilistic streamlines and shows the detailed flow distribution into the brachiocephalic, carotid, and subclavian arteries. Fig. 2 shows a 4D connectivity map based on probabilistic particle traces seeded in a cross-section of the ascending aorta. A first application of the proposed probabilistic flow connectivity mapping method is as a novel visualization technique that addresses the uncertainty in the PC MRI measurements. New probabilistic measures for quantifying possible flow trajectories are also envisaged, e.g., to assign a likelihood to a flow pathway connecting two vascular regions of interest to evaluate mixing of blood, or to quantify embolization probabilities in stroke and infarction. REFERENCES [1] H. Gudbjartsson et al. Magn. Reson. Med. (1995), 34(6):910-914. [2] A.H. Andersen et al. Med. Phys (1996), 23(6):857-869. [3] J. Sijbers. Ph.D Thesis (1998). Fig 1. a) A regular streamline initiated at the arrow. b) 50 probabilistic streamlines from the same point. c) A flow connectivity map based on 4000 probabilistic streamlines. Fig 2. A 4D flow connectivity map based on probabilistic particle traces using an entire crosssection as seed region. The colors may be interpreted as the likelihood of finding a virtual particle in a voxel and time interval. The length of the time intervals is 48.8 ms. a) b) c) t1<t<t2 t0<t<t1 t5<t<t6 t4<t<t5 t2<t<t3 Proc. Intl. Soc. Mag. Reson. Med. 18 (2010) 1334
منابع مشابه
Use of linkage mapping and centrality analysis across habitat gradients to conserve connectivity of gray wolf populations in western North America.
Centrality metrics evaluate paths between all possible pairwise combinations of sites on a landscape to rank the contribution of each site to facilitating ecological flows across the network of sites. Computational advances now allow application of centrality metrics to landscapes represented as continuous gradients of habitat quality. This avoids the binary classification of landscapes into pa...
متن کاملConnectivity as a Measure of Power System Integrity
Measures of network structural integrity useful in the analysis and synthesis of power systems are discussed. Signal flow methodology is applied to derive an expression for the paths between sources and sinks in a power network. Connectivity and reach ability properties of the network are obtained using the minors of a modified connectivity matrix. Node-connectivity, branch connectivity and mix...
متن کاملA Probabilistic Framework to Infer Brain Functional Connectivity from Anatomical Connections
We present a novel probabilistic framework to learn across several subjects a mapping from brain anatomical connectivity to functional connectivity, i.e. the covariance structure of brain activity. This prediction problem must be formulated as a structured-output learning task, as the predicted parameters are strongly correlated. We introduce a model selection framework based on cross-validatio...
متن کاملA Max-Flow Based Algorithm for Connected Target Coverage with Probabilistic Sensors
Coverage is a fundamental issue in the research field of wireless sensor networks (WSNs). Connected target coverage discusses the sensor placement to guarantee the needs of both coverage and connectivity. Existing works largely leverage on the Boolean disk model, which is only a coarse approximation to the practical sensing model. In this paper, we focus on the connected target coverage issue b...
متن کامل